Every P-convex subset of $${\mathbb{R}^2}$$ is already strongly P-convex
نویسندگان
چکیده
منابع مشابه
When every $P$-flat ideal is flat
In this paper, we study the class of rings in which every $P$-flat ideal is flat and which will be called $PFF$-rings. In particular, Von Neumann regular rings, hereditary rings, semi-hereditary ring, PID and arithmetical rings are examples of $PFF$-rings. In the context domain, this notion coincide with Pr"{u}fer domain. We provide necessary and sufficient conditions for...
متن کاملOn the quadratic support of strongly convex functions
In this paper, we first introduce the notion of $c$-affine functions for $c> 0$. Then we deal with some properties of strongly convex functions in real inner product spaces by using a quadratic support function at each point which is $c$-affine. Moreover, a Hyers–-Ulam stability result for strongly convex functions is shown.
متن کاملConvex Sets of Nonsingular and P–matrices
We show that the set r(A,B) (resp. c(A,B)) of square matrices whose rows (resp. columns) are independent convex combinations of ∗Work supported in part by Office of Naval Research contract N00014–90–J–1739 and NSF grant DMS 90–00899. †Work partially supported by NSERC grant 6–53121. Part of the work was done while this author was a Visiting Assistant Professor at the College of William and Mary.
متن کاملPROPERTIES OF CERTAIN p-VALENTLY CONVEX FUNCTIONS
for some α (0 α< 1). We denote by p(α) the subclass of p consisting of functions which are p-valently convex of order α in U. In particular, we denote 1(0)= . A function f(z)∈ 1 is said to be uniformly convex inU if f(z) is in the class and has the property that the image arc f(γ) is convex for every circular arc γ contained in U with center at t ∈ U. We also denote by the subclass of 1 consist...
متن کاملConvex p-partitions of bipartite graphs
A set of vertices X of a graph G is convex if it contains all vertices on shortest paths between vertices of X. We prove that for fixed p ≥ 1, all partitions of the vertex set of a bipartite graph into p convex sets can be found in polynomial time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematische Zeitschrift
سال: 2010
ISSN: 0025-5874,1432-1823
DOI: 10.1007/s00209-010-0765-7